A Probabilistic Approach to Latent Cluster Analysis
نویسندگان
چکیده
Facing a large number of clustering solutions, cluster ensemble method provides an effective approach to aggregating them into a better one. In this paper, we propose a novel cluster ensemble method from probabilistic perspective. It assumes that each clustering solution is generated from a latent cluster model, under the control of two probabilistic parameters. Thus, the cluster ensemble problem is reformulated into an optimization problem of maximum likelihood. An EM-style algorithm is designed to solve this problem. It can determine the number of clusters automatically. Experimenal results have shown that the proposed algorithm outperforms the state-of-the-art methods including EAC-AL, CSPA, HGPA, and MCLA. Furthermore, it has been shown that our algorithm is stable in the predicted numbers of clusters.
منابع مشابه
Co-clustering for Weblogs in Semantic Space
Web clustering is an approach for aggregating web objects into various groups according to underlying relationships among them. Finding co-clusters of web objects in semantic space is an interesting topic in the context of web usage mining, which is able to capture the underlying user navigational interest and content preference simultaneously. In this paper we will present a novel web co-clust...
متن کاملProbabilistic Methods for Service Clustering
This paper focuses on service clustering and uses service descriptions to construct probabilistic models for service clustering. We discuss how service descriptions can be enriched with machine-interpretable semantics and then we investigate how these service descriptions can be grouped in clusters in order to make discovery, ranking, and recommendation faster and more effective. We propose usi...
متن کاملHINMF: A Matrix Factorization Method for Clustering in Heterogeneous Information Networks
Non-negative matrix factorization (NMF) has become quite popular recently on the relational data due to its several nice properties and connection to probabilistic latent semantic analysis (PLSA). However, few algorithms take this route for the heterogeneous networks. In this paper we propose a novel clustering method for heterogeneous information networks by searching for a factorization that ...
متن کاملMultimodal Object Recognition Using Random Clustering Trees
In this paper, we present an object recognition approach that in addition allows to discover intra-class modalities exhibiting highcorrelated visual information. Unlike to more conventional approaches based on computing multiple specialized classi ers, the proposed approach combines a single classi er, Boosted Random Ferns (BRFs), with probabilistic Latent Semantic Analysis (pLSA) in order to r...
متن کاملConstructing Visual Models with a Latent Space Approach
We propose the use of latent space models applied to local invariant features for object classification. We investigate whether using latent space models enables to learn patterns of visual co-occurrence and if the learned visual models improve performance when less labeled data are available. We present and discuss results that support these hypotheses. Probabilistic Latent Semantic Analysis (...
متن کامل